Extending Compositional Message Sequence Graphs

نویسندگان

  • Benedikt Bollig
  • Martin Leucker
  • Philipp Lucas
چکیده

We extend the formal developments for message sequence charts (MSCs) to support scenarios with lost and found messages. We define a notion of extended compositional message sequence charts (ECMSCs) which subsumes the notion of compositional message sequence charts in expressive power but additionally allows to define lost and found messages explicitly. As usual, ECMSCs might be combined by means of choice and repetition towards (extended) compositional message sequence graphs. We show that despite extended expressive power model checking of monadic second-order logic (MSO) for this framework remains to be decidable. The key technique to achieve our results is to use an extended notion for linearizations. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-02-09. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/171 Extending Compositional Message Sequence Graphs Benedikt Bolligl, Martin Leucker2*, and Philipp Lucas' Lehrstuhl fiir Informatik 11, Aachen University of Technology (RWTH), Germany {bollig,phlucas}Qi2. inf ormatik. rwth-aachen. de Dept. of Computer and Information Science, University of Pennsylvania, USA leuckerQcis.upenn.edu Abstract. We extend the formal developments for message sequence charts (MSCs) to support scenarios with lost and found messages. We define a notion of extended compositional message sequence charts (ECMSCs) which subsumes the notion of compositional message sequence charts in expressive power but additionally allows to define lost and found messages explicitly. As usual, ECMSCs might be combined by means of choice and repetition towards (extended) compositional message sequence graphs. We show that^-despite extended expressive power-model checking of monadic second-order logic (MSO) for this framework remains to be decidable. The key technique to achieve our results is to use an We extend the formal developments for message sequence charts (MSCs) to support scenarios with lost and found messages. We define a notion of extended compositional message sequence charts (ECMSCs) which subsumes the notion of compositional message sequence charts in expressive power but additionally allows to define lost and found messages explicitly. As usual, ECMSCs might be combined by means of choice and repetition towards (extended) compositional message sequence graphs. We show that^-despite extended expressive power-model checking of monadic second-order logic (MSO) for this framework remains to be decidable. The key technique to achieve our results is to use an extended notion for linearizations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision Tree Induction for Identifying Trends in Line Graphs

Information graphics (such as bar charts and line graphs) in popular media generally convey a message. This paper presents our approach to a significant problem in extending our message recognition system to line graphs — namely, the segmentation of the graph into a sequence of visually distinguishable trends. We use decision tree induction on attributes derived from statistical tests and featu...

متن کامل

Covariant Compositional Networks For Learning Graphs

Most existing neural networks for learning graphs address permutation invariance by conceiving of the network as a message passing scheme, where each node sums the feature vectors coming from its neighbors. We argue that this imposes a limitation on their representation power, and instead propose a new general architecture for representing objects consisting of a hierarchy of parts, which we ca...

متن کامل

Factor Graphs and Dynamical Electrical Networks

Abstract — Factor graphs are graphical models with origins in coding theory. The sum-product and the maxproduct algorithms, which operate by message passing on a factor graph, subsume a great variety of algorithms in coding, signal processing, and artificial intelligence. This paper aims at extending the field of possible applications to dynamical electrical networks. Interestingly, the resulti...

متن کامل

Compositional Type Checking for Hindley-Milner Type Systems with Ad-hoc Polymorphism

Statically typed functional programming languages usually employ a version of the Hindley-Milner type system extended with ad-hoc polymorphism. When the type checker detects an error, it has to report it to the programmer, to help in fixing the bug. However, usage of algorithmsW andM, commonly used to type-check languages with Hindley-Milner type systems, can result in cryptic error messages. W...

متن کامل

Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces

Message sequence charts (MSC) are a graphical speciica-tion language widely used for designing communication protocols. Our starting point are two decision problems concerning the correctness and the consistency of a design based by MSC graphs. Both problems are shown to be undecidable, in general. Using a natural connectivity assumption from Mazurkiewicz trace theory we show both problems to b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002